Path graph

Results: 1083



#Item
451Streaming Algorithms for k-core Decomposition ¨ Ahmet Erdem Sarıy¨uce†⇧ , Bu˘gra Gedik‡ , Gabriela Jacques-Silva⇤ , Kun-Lung Wu⇤ , Umit V. C¸ataly¨urek† [removed], [removed], g.j

Streaming Algorithms for k-core Decomposition ¨ Ahmet Erdem Sarıy¨uce†⇧ , Bu˘gra Gedik‡ , Gabriela Jacques-Silva⇤ , Kun-Lung Wu⇤ , Umit V. C¸ataly¨urek† [removed], [removed], g.j

Add to Reading List

Source URL: www.vldb.org

Language: English - Date: 2013-06-29 06:26:56
452Optimal Enumeration: Efficient Top-k Tree Matching Lijun Chang† , Xuemin Lin£† , Wenjie Zhang† , Jeffrey Xu Yu‡ , Ying Zhang§ , Lu Qin§ † University of New South Wales, Australia, {ljchang,lxue,zhangw}@cse.

Optimal Enumeration: Efficient Top-k Tree Matching Lijun Chang† , Xuemin Lin£† , Wenjie Zhang† , Jeffrey Xu Yu‡ , Ying Zhang§ , Lu Qin§ † University of New South Wales, Australia, {ljchang,lxue,zhangw}@cse.

Add to Reading List

Source URL: www.vldb.org

Language: English - Date: 2014-12-17 10:02:22
453The Filter-Placement Problem and its Application to Minimizing Information Multiplicity Dora Vatche Ishakian Andrei Lapets Evimaria Terzi Azer Bestavros ´ Erdos ¨

The Filter-Placement Problem and its Application to Minimizing Information Multiplicity Dora Vatche Ishakian Andrei Lapets Evimaria Terzi Azer Bestavros ´ Erdos ¨

Add to Reading List

Source URL: vldb.org

Language: English - Date: 2012-01-21 14:29:58
454Comparing Stars: On Approximating Graph Edit Distance § †  §

Comparing Stars: On Approximating Graph Edit Distance § † §

Add to Reading List

Source URL: www.vldb.org

Language: English - Date: 2009-07-27 10:29:02
455A General Method for Assessment of Security in Complex Services ⋆ Leanid Krautsevich1 , Fabio Martinelli2 , and Artsiom Yautsiukhin2 1  2

A General Method for Assessment of Security in Complex Services ⋆ Leanid Krautsevich1 , Fabio Martinelli2 , and Artsiom Yautsiukhin2 1 2

Add to Reading List

Source URL: wwwold.iit.cnr.it

Language: English - Date: 2011-08-10 05:58:47
456Efficient Subgraph Matching on Billion Node Graphs Zhao Sun ∗  Fudan University

Efficient Subgraph Matching on Billion Node Graphs Zhao Sun ∗ Fudan University

Add to Reading List

Source URL: vldb.org

Language: English - Date: 2012-05-30 02:58:50
457CS 157: Assignment 2 Douglas R. Lanman 27 February 2006 Problem 1: Union-Find with Deletions The union-find data structure, utilizing the “union-by-rank” and “path compression” heuristics, is

CS 157: Assignment 2 Douglas R. Lanman 27 February 2006 Problem 1: Union-Find with Deletions The union-find data structure, utilizing the “union-by-rank” and “path compression” heuristics, is

Add to Reading List

Source URL: mesh.brown.edu

Language: English - Date: 2006-02-27 14:13:36
458Abstracts Manuel Bodirsky, Ecole Polytechnique The Product Ramsey Theorem in Constraint Satisfaction Complexity In this talk, I show how the product Ramsey theorem can be used jointly with tools from universal algebra to

Abstracts Manuel Bodirsky, Ecole Polytechnique The Product Ramsey Theorem in Constraint Satisfaction Complexity In this talk, I show how the product Ramsey theorem can be used jointly with tools from universal algebra to

Add to Reading List

Source URL: asz.informatik.hu-berlin.de

Language: English - Date: 2008-06-05 10:03:31
459RTED: A Robust Algorithm for the Tree Edit Distance Mateusz Pawlik Nikolaus Augsten  Free University of Bozen-Bolzano

RTED: A Robust Algorithm for the Tree Edit Distance Mateusz Pawlik Nikolaus Augsten Free University of Bozen-Bolzano

Add to Reading List

Source URL: vldb.org

Language: English - Date: 2011-12-25 09:36:24
460Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation Lingkun Wu† , Xiaokui Xiao† , Dingxiong Deng§ , Gao Cong† , Andy Diwen Zhu† , Shuigeng Zhou§ † School of Computer Engineering

Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation Lingkun Wu† , Xiaokui Xiao† , Dingxiong Deng§ , Gao Cong† , Andy Diwen Zhu† , Shuigeng Zhou§ † School of Computer Engineering

Add to Reading List

Source URL: vldb.org

Language: English - Date: 2012-01-21 14:29:56